A Fixpoint Theory for Non-monotonic Parallelism
ثبت نشده
چکیده
منابع مشابه
A Fixpoint Theory for Non-monotonic Parallelism
This paper studies parallel recursion. The trace specification language used in this paper incorporates sequentiality, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski’s theorem to determine the fixpoints of recursions, we need to identify a we...
متن کاملSemantics for Active Integrity Constraints Using Approximation Fixpoint Theory
Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning. In this pap...
متن کاملGrounded Fixpoints
Algebraical fixpoint theory is an invaluable instrument for studying semantics of logics. For example, all major semantics of logic programming, autoepistemic logic, default logic and more recently, abstract argumentation have been shown to be induced by the different types of fixpoints defined in approximation fixpoint theory (AFT). In this paper, we add a new type of fixpoint to AFT: a ground...
متن کاملNon-monotonic modal logic of belief
We propose an alternative non-monotonic modal formalism called non-monotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mφ : E 6`S ¬φ}) with the belief fixpoint equation E = ThS(A ∪ {Mφ : E 6`S ¬Mφ}). The solutions of the belief fixpoint equation, called belief S-expansions, are tightly related to the logic of belief KD45. We show interpretation...
متن کاملar X iv : c s / 04 05 00 2 v 1 [ cs . A I ] 3 M ay 2 00 4 Splitting an operator Algebraic modularity results for logics with fixpoint semantics
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different “levels”, such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and defaul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001